Article Per Year (5 Year)
p-Index From 2019 - 2024
0.408
P-Index
This Author published in this journals
All Journal CAUCHY: Jurnal Matematika Murni dan Aplikasi Prosiding Seminar Matematika dan Pendidikan Matematik
Ridho Alfarisi, Ridho
Unknown Affiliation
Education Mathematics

Published : 6 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Prosiding Seminar Matematika dan Pendidikan Matematik

 1 
Analisa Himpunan Dominasi pada Graf-Graf Khusus Alfarisi, Ridho; Dafik, Dafik; Fatahillah, Arif
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1, No 1 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The advance of science and technology increases proportionally to the development of era. Today era tends to the raise to the advance of ICT. One research interest which supports the ICT development is a graph theory. A dominating set theory is one of a graph theory which has a wide range of applications mainly in communication network and space syntax theory. A set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $uin V(G)-D$ is adjacent to some vertex $vin D$. The domination number of a graph $G$, denoted by $gamma_{k}{G}$; $kin{{1,2}}$, is the order of a smallest dominating set of $G$. This research aims to find the domination number of some families of special graphs, disc brake graph $Db_{n,m}$, lampion graph $pounds_{n,m}$, prism graph $D_{n,m}$, and staked ladder graph $Dt_{n,m}$.
Analisa Himpunan Dominasi pada Graf-Graf Khusus Alfarisi, Ridho; Dafik, Dafik; Fatahillah, Arif
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The advance of science and technology increases proportionally to the development of era. Today era tends to the raise to the advance of ICT. One research interest which supports the ICT development is a graph theory. A dominating set theory is one of a graph theory which has a wide range of applications mainly in communication network and space syntax theory. A set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $u\in V(G)-D$ is adjacent to some vertex $v\in D$. The domination number of a graph $G$, denoted by $\gamma_{k}{G}$; $k\in{\{1,2\}}$, is the order of a smallest dominating set of $G$. This research aims to find the domination number of some families of special graphs, disc brake graph $Db_{n,m}$, lampion graph $\pounds_{n,m}$, prism graph $D_{n,m}$, and staked ladder graph $Dt_{n,m}$.
Co-Authors Arika Indah Kristiana D. Dafik Ika Hesti Agustin, Ika Hesti Marsidi Marsidi Prihandini, Rafiantika M. Ratna Dwi Christyanti, Ratna Dwi Siswono, Hendrik Siti Aisyah